Algorithmic Construction of Hurwitz Maps

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction of p-adic Hurwitz spaces

Moduli spaces for Galois covers of p-adic Mumford curves by Mumford curves are constructed using Herrlich’s Teichmüller spaces, André’s orbifold fundamental groups, and Kato’s graphs of groups encoding ramification data of charts for Mumford orbifolds.

متن کامل

An Algorithmic Approach to the Construction of Homomorphisms Induced by Maps in Homology

This paper is devoted to giving the theoretical background for an algorithm for computing homomorphisms induced by maps in homology. The principal idea is to insert the graph of a given continuous map f into a graph of a multi-valued representable map F . The multi-valued representable maps have well developed continuity properties and admit a finite coding that permits treating them by combina...

متن کامل

Stable Maps and Hurwitz Schemes in Mixed Characteristic

The Hurwitz scheme was originally conceived as a parameter space for simply branched covers of the projective line. A variant of this is a parameter spaec for simply branched covers of the projective line, up to automorphisms of P the so called unparametrized Hurwitz scheme. Other variants involve fixing branching types which are not necessarily simple (see [D-D-H]). A rigorous algebraic defini...

متن کامل

Algorithmic Aspects of Golomb Ruler Construction

We consider Golomb rulers and their construction. Common rulers feature marks at every unit measure, distances can often be measured with numerous pairs of marks. On Golomb rulers, for every distance there are at most two marks measuring it. The construction of optimal—with respect to shortest length for given number of marks or maximum number of marks for given length—is nontrivial, various pr...

متن کامل

An Algorithmic Framework for Labeling Road Maps

Given an unlabeled road map, we consider, from an algorithmic perspective, the cartographic problem of placing non-overlapping road labels embedded in the roads. We first decompose the road network into logically coherent road sections, i.e., parts of roads between two junctions. Based on this decomposition, we present and implement a new and versatile framework for placing labels in road maps ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Experimental Mathematics

سال: 2015

ISSN: 1058-6458,1944-950X

DOI: 10.1080/10586458.2013.860569